Channel-based coordination via constraint satisfaction
نویسندگان
چکیده
منابع مشابه
Channel-based coordination via constraint satisfaction
Coordination in Reo emerges from the composition of the behavioural constraints of primitives, such as channels, in a component connector. Understanding and implementing Reo, however, has been challenging due to the interaction of the channel metaphor, which is an inherently local notion, and the non-local nature of the constraints imposed by composition. In this paper, the channel metaphor tak...
متن کاملConstraint-Based Dogleg Channel Routing with Via Minimization
In this article, we present an algorithm which is capable of transforming a gridded dogleg channel routing problem into a constraint programming (CP) problem. The transformed CP problem consists of a set of variables and a list of constraints; it can be solved by JaCoP, a finite-domain constraint programming solver. For a given dogleg channel routing problem, our approach is able to minimize th...
متن کاملPriority-Based Geometric Constraint Satisfaction
A well-constrained geometric system seldom occurs in practice, especially at the sketchbased initial conceptual design stage. Usually, it is either underor overconstrained because design is a progressive process and it is difficult for a designer to specify all involved constraints in a consistent way. This paper presents a priority-based graphreduction solution, in which each constraint is ass...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملConstraint Satisfaction Search 1 Constraint Satisfaction Problems
For the past thirty ve years artiicial intelligence researchers have been studying heuristic search techniques. People writing AI programs have had strong intuitions about what it means for a program to search. Intuitively they classiied programs according to the kinds of search performed. Certain programs, such as matrix multiplication routines, did no search whatsoever. Other programs searche...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2011
ISSN: 0167-6423
DOI: 10.1016/j.scico.2010.05.004